Greedy multiprocessor server scheduling
نویسندگان
چکیده
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the `p norms of weighted flow time onm identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملAn Application of Bin-Packing to Multiprocessor Scheduling
Processing Time first algorithm always finds a schedule having makespan within 43 1. Key words, bin packing, multiprocessor scheduling, approximation.Single capacity bin-packing algorithms were applied to solve this problem. Available system resources, the scheduling algorithm must be able to maintain a job working set. Bounds for multiprocessor scheduling with resource.We consider a natural ge...
متن کاملA 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks
We present a new approximation algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines. We prove that for an arbitrary parameter k E N it yields solutions with at most (~ + t )OPT + 9k many processors, thus it gives an asymptotic 3/2-approximation algorithm. This improves over the previously best known ratio of 7/4. Our algorithm can be implemented to ru...
متن کاملAn unfair semi-greedy real-time multiprocessor scheduling algorithm
Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorith...
متن کاملSNS: A Simple Model for Understanding Optimal Hard Real-Time Multiprocessor Scheduling
We consider the problem of optimal real-time scheduling of periodic tasks for multiprocessors. A number of recent papers have used the notion of fluid scheduling to guarantee optimality and improve performance. In this paper, we examine exactly how fluid scheduling techniques overcome inherent problems faced by greedy scheduling algorithms such as EDF. Based on these foundations, we describe a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 34 شماره
صفحات -
تاریخ انتشار 2006